Solving Bi-objective Model of Hotel Revenue Management Considering Customer Choice Behavior Using Meta-heuristic Algorithms
نویسندگان
چکیده مقاله:
The problem of maximizing the benefit from a specified number of a particular product with respect to the behavior of customer choices is regarded as revenue management. This managerial technique was first adopted by the airline industries before being widely used by many others such as hotel industries. The scope of this research is mainly focused on hotel revenue management, regarding which a bi-objective model is proposed. The suggested method aims at increasing the revenue of hotels by assigning the same rooms to different customers. Maximization of hotel revenue is a network management problem aiming to manage several resources simultaneously. Accordingly, a model is proposed in this paper based on the customer choice behavior in which the customers are divided into two groups of business and leisure. Customers of the business group prefer products with full price, whereas products with discounts are most desirable for leisure customers. The model consists of two objectives, the first one of which maximizes the means of revenue, and the second one minimizes the dispersion of revenue. Since the problem under consideration is Non-deterministic Polynomial-time hard (NP-hard), two meta-heuristic algorithms of Non-dominated Sorting Genetic Algorithm-II (NSGA-II) and Multiple Objective Particle Swarm Optimization (MOPSO) are proposed to solve the problem. Moreover, the tuned algorithms are compared via the statistical analysis method. The results show that the NSGA-II is more efficient in comparison with MOPSO.
منابع مشابه
A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice
We consider a network revenue management problem with customer choice and exogenous prices. We study the performance of a class of certainty equivalent heuristic control policies. These heuristics periodically re-solve the deterministic Linear Program (DLP) that results when all future random variables are replaced by their average values and implement the solutions in a probabilistic manner. W...
متن کاملStudy on Revenue Management Considering Strategic Customer Behavior
This article reviews the literatures of revenue management and introduces the status of traditional research about perishable products in this field. We analyze revenue management considering strategic customer behavior and the related researches about dynamic pricing, finally we discuss the existing problems and suggest several future research directions.
متن کاملRandomization Approaches for Network Revenue Management with Customer Choice Behavior
In this paper, we present new approximation methods for the network revenue management problem with customer choice behavior. Our methods are sampling-based and so we require only minimal assumptions regarding the underlying customer choice model. The starting point for our methods is a dynamic program that allows randomization. An attractive feature of this dynamic program is that the size of ...
متن کاملRevenue Management for Parallel Flights with Customer-Choice Behavior
We consider the simultaneous seat-inventory control of a set of parallel flights between a common origin and destination with dynamic customer choice among the flights. We formulate the problem as an extension of the classic multiperiod, single-flight “block demand” revenue management model. The resulting Markov decision process is quite complex, owing to its multidimensional state space and th...
متن کاملComputing Bid Prices for Revenue Management Under Customer Choice Behavior
W consider a choice-based, network revenue management (RM) problem in a setting where heterogeneous customers consider an assortment of products offered by a firm (e.g., different flight times, fare classes, and/or routes). Individual choice decisions are modeled through an ordered list of preferences, and minimal assumptions are made about the statistical properties of this demand sequence. Th...
متن کاملExact algorithms for solving a bi-level location–allocation problem considering customer preferences
The issue discussed in this paper is a bi-level problem in which two rivals compete in attracting customers and maximizing their profits which means that competitors competing for market share must compete in the centers that are going to be located in the near future. In this paper, a nonlinear model presented in the literature considering customer preferences is linearized. Customer behavior ...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 14 شماره 1
صفحات 10- 18
تاریخ انتشار 2021-03-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023